Fuzzy heterogeneous neurons for imprecise classification problems
نویسندگان
چکیده
منابع مشابه
Fuzzy heterogeneous neurons for imprecise classification problems
In the classical neuron model, inputs are continuous real-valued quantities. However, in many important domains from the real world, objects are described by a mixture of continuous and discrete variables, usually containing missing information and uncertainty. In this paper, a general class of neuron models accepting heterogeneous inputs in the form of mixtures of continuous (crisp and/or fuzz...
متن کاملDecomposition of Heterogeneous Classification Problems
In some classi cation problems the feature space is heterogeneous in that the best features on which to base the classi cation are di erent in di erent parts of the feature space. In some other problems the classes can be divided into subsets such that distinguishing one subset of classes from another and classifying examples within the subsets require very di erent decision rules, involving di...
متن کاملGenetic Fuzzy Discretization for Classification Problems
Many real-world classification algorithms can not be applied unless the continuous attributes are discretized and the interval discretization methods are used in many machine learning techniques. It is hard to determine the intervals for the discretization of numerical attributes that has an infinite number of candidates. And interval discretization methods are based on a crisp set, a value in ...
متن کاملFuzzy Miner - A Fuzzy System for Solving Pattern Classification Problems
The purpose of this paper is to study the problem of pattern classification as this is presented in the context of data mining. Among the various approaches we focus on the use of Fuzzy Logic for pattern classification, due to its close relation to human thinking. More specifically, this paper presents a heuristic fuzzy method for the classification of numerical data, followed by the design and...
متن کاملGlobal Optimization for Imprecise Problems
A new method for the computation of the global minimum of a continuously differentiable real–valued function f of n variables is presented. This method, which is composed of two parts, is based on the combinatorial topology concept of the degree of a mapping associated with an oriented polyhedron. In the first part, interval arithmetic is implemented for a “rough” isolation of all the stationar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Intelligent Systems
سال: 2000
ISSN: 0884-8173,1098-111X
DOI: 10.1002/(sici)1098-111x(200003)15:3<265::aid-int7>3.0.co;2-i